翻訳と辞書 Words near each other ・ Many-angled ones ・ Many-banded aracari ・ Many-banded krait ・ Many-banded tree frog ・ Many-banded tree snake ・ Many-body problem ・ Many-body theory ・ Many-colored bushshrike ・ Many-colored Chaco finch ・ Many-coloured fruit dove ・ Many-coloured rush tyrant ・ Many-eyed snake-eel ・ Many-finned sea serpent ・ Many-lined salamander ・ Many-minds interpretation ・ Many-one reduction ・ Many-plumed moth ・ Many-ribbed salamander ・ Many-scaled anole ・ Many-scaled cylindrical skink ・ Many-sorted logic ・ Many-spotted hummingbird ・ Many-striped canastero ・ Many-task computing ・ Many-to-many ・ Many-to-many (data model) ・ Many-valued logic ・ Many-worlds interpretation ・ Manya ・ Manya (actress) Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Many-one reduction ： ウィキペディア英語版 Many-one reduction In computability theory and computational complexity theory, a many-one reduction is a reduction which converts instances of one decision problem into instances of a second decision problem. Reductions are thus used to measure the relative computational difficulty of two problems. Many-one reductions are a special case and stronger form of Turing reductions. With many-one reductions the oracle can be invoked only once at the end and the answer cannot be modified. Many-one reductions were first used by Emil Post in a paper published in 1944.〔E. L. Post, "Recursively enumerable sets of positive integers and their decision problems", Bulletin of the American Mathematical Society 50 (1944) 284-316〕 Later Norman Shapiro used the same concept in 1956 under the name ''strong reducibility''. == Definitions == 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Many-one reduction」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.